Transformations of CCP programs
نویسندگان
چکیده
منابع مشابه
Unfold/Fold Transformations of CCP Programs
We introduce a transformation system for concurrent constraint programming (CCP). We deene suitable applicability conditions for the transformations which guarantee that the input/output ccp semantics is preserved also when distinguishing deadlocked computations from successful ones. The systems allows to optimize CCP programs while preserving their intended meaning. Furthermore, since it prese...
متن کاملCorrect Transformations of Logic Programs
This paper describes a system of transformations that preserves the semantics of logic programs with respect to a xed goal. We formalise some standard transformations and introduce two new transformation rules: Copying/Merge of Copies and Contextual Replacement by Equal Term. Correctness of all schemes of the transformation rules is proved. The applicability conditions of the schemes of rules a...
متن کاملTransformations of logic programs on infinite lists
We consider an extension of logic programs, called ω-programs, that can be used to define predicates over infinite lists. ω-programs allow us to specify properties of the infinite behavior of reactive systems and, in general, properties of infinite sequences of events. The semantics of ω-programs is an extension of the perfect model semantics. We present variants of the familiar unfold/fold rul...
متن کاملEquivalent Transformations of Heterogeneous Meta-Programs
We consider a generalization of heterogeneous meta-programs by (1) introducing an extra level of abstraction within the meta-program structure, and (2) meta-program transformations. We define basic terms, formalize transformation tasks, consider properties of meta-program transformations and rules to manage complexity through the following transformation processes: (1) reverse transformation, w...
متن کاملFormal Verification of Programs and Their Transformations
Formal verification is an act of using formal methods to check the correctness of intended programs. The verification is done by providing a formal proof on an abstract mathematical model of the program, with respect to a certain formal specification or property. We present three case studies on using formal methods to verify programs and their transformations: (1) we use term rewriting and the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Programming Languages and Systems
سال: 2001
ISSN: 0164-0925,1558-4593
DOI: 10.1145/503502.503504